On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ?

Source URL: www.mimuw.edu.pl

• Tree automaton
• Omega language
• Regular language
• Deterministic automaton
• Ω-automaton
• Büchi automaton
• Automata theory
• Theoretical computer science
• Computer science

Regular-expression derivatives reexamined SCOTT OWENS University of Cambridge

Source URL: www.ccs.neu.edu

• Models of computation
• Computer science
• Software engineering
• Nondeterministic finite automaton
• Deterministic finite automaton
• Regular language
• Symbol
• String
• Regular expression
• Automata theory
• Formal languages
• Theoretical computer science

On Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II Tony Tan School of Informatics, University of Edinburgh Abstract

Source URL: alpha.uhasselt.be

• Computer science
• Pebble automaton
• Regular language
• Turing machine
• Linear temporal logic
• Ω-automaton
• Automata theory
• Theory of computation
• Theoretical computer science

Tree Automata over Infinite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori

Source URL: alpha.uhasselt.be

• Tree automaton
• Regular language
• Logic
• Ω-automaton
• Automata theory
• Symbol
• Model theory

JMLR: Workshop and Conference Proceedings 34:109–123, 2014 Proceedings of the 12th ICGI Learning Nondeterministic Mealy Machines Ali Khalili

Source URL: jmlr.org

• Symbol
• Mealy machine
• Finite-state machine
• Regular language
• Computing
• Mathematics
• Finite state transducer
• Automata theory
• Models of computation
• Nondeterministic finite automaton

JMLR: Workshop and Conference Proceedings 34:139–152, 2014 Proceedings of the 12th ICGI Grammatical Inference of some Probabilistic Context-Free Grammars from Positive Data using Minimum Satisfiability

Source URL: jmlr.org

• Grammar
• Context-free grammar
• Stochastic context-free grammar
• Chomsky normal form
• Formal grammar
• CYK algorithm
• LL parser
• Regular language
• Grammar induction
• Formal languages
• Linguistics
• Logic

JMLR: Workshop and Conference Proceedings 34:49–63, 2014 Proceedings of the 12th ICGI A bottom-up efficient algorithm learning substitutable languages from positive examples

Source URL: jmlr.org

• Software engineering
• String
• Regular language
• Context-free grammar
• Formal grammar
• Regular expression
• Algorithm
• Formal languages
• Combinatorics
• Mathematics

Stricken language would be deleted from and underlined language would be added to present law. Act 1043 of the Regular Session 1 State of Arkansas

Source URL: amvc.arkansas.gov

• Manufacturing
• Economy of the United States
• Technology
• Car dealerships in North America
• Department of Motor Vehicles
• Warranty
• Caterpillar Inc.

PINELLAS COUNTY CONSTRUCTION LICENSING BOARD MINUTES The regular bimonthly meeting of the Pinellas County Construction Licensing Board was held at the Largo City Hall Community Room, 201 Highland Avenue, Largo on Novembe

Source URL: www.pcclb.com

• C
• Software engineering
• Second
• Programming language theory
• Computing
• Democracy
• Motion

Stricken language would be deleted from and underlined language would be added to present law. Act 895 of the Regular Session 1 State of Arkansas

Source URL: www.arkleg.state.ar.us